Analysis of Queues with Bat h Arrivals
نویسنده
چکیده
The steady state distribution of quasi-birth-death pro esses an be eÆ iently obtained by matrix-geometri (MG) methods. Sin e a number of tele ommuni ation problems are modelled by pro esses with bat h arrivals, the extension of MG methods for these pro esses has pra ti al importan e. This paper presents an extension of MG methods whi h is e e tive for the analysis of quasi-birth-death pro esses with bat h arrivals. The proposed method is ompared with one of the well-known methods.
منابع مشابه
Numeri al Analysis of Queues with Bat h Arrivals
The steady state distribution of quasi-birth-death pro esses an be eÆ iently obtained by matrix-geometri (MG) methods. Sin e a number of tele ommuni ation problems are modelled by pro esses with bat h arrivals, the extension of MG methods for these pro esses has pra ti al importan e. This paper presents an extension of MG methods whi h is e e tive for the analysis of quasi-birth-death pro esses...
متن کاملMODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS
Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....
متن کاملA Unified Method to Analyze Overtake Free Queueing Systems
In this paper we demonstrate that the distributional laws that relate the number of customers in the system (queue), L(Q) and the time a customer spends in the system (queue), S(W) under the first-in-first-out (FIFO) discipline are special cases of the H = AG law and lead to a complete solution for the distributions of L, Q, S, W for queueing systems which satisfy distributional aws for both L ...
متن کاملA new method for deriving waiting-time approximations in polling systems with renewal arrivals
We study the waiting-time distributions in cyclic polling models with renewal arrivals, general service and switch-over times, and exhaustive service at each of the queues. The assumption of renewal arrivals prohibits an exact analysis and reduces the available analytic results to heavy-traffic asymptotics, limiting results for large switch-over times and large numbers of queues, and some numer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007